Abstraction-Guided Symbolic Model Checking
نویسندگان
چکیده
ion-Guided Symbolic Model Checking PhD Candidate: Kairong Qian Academic Advisor: Albert Nymeyer School of Computer Science & Engineering The University of New South Wales, Sydney Australia {kairongq, anymeyer}@cse.unsw.edu.au Tel: +61 2 9586 0636 Mob: +61 4 1142 2042 Expected Graduation on December 2005
منابع مشابه
Efficient Testing of Concurrent Programs with Abstraction-Guided Symbolic Execution
ion-Guided Symbolic Execution Neha Rungta, Eric G Mercer and Willem Visser∗ Dept. of Computer Science, Brigham Young University, Provo, UT 84602, USA ∗SEVEN Networks, 901 Marshall Street, Redwood City, CA 94063, USA Abstract. Exhaustive search techniques such as model checking and Exhaustive search techniques such as model checking and symbolic execution are insufficient to detect errors in con...
متن کاملTerminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checking and iterative counterexample-guided abstraction refinement, etc.) are restricted to safety properties. Terminator is the first software model checker for termination. It is now being used to prove that device driver dispatch routines always return to their caller (or r...
متن کاملExperiments with SAT-Based Symbolic Simulation Using Reparameterization in the Abstraction Refinement Framework
This paper presents experimental results on the performance effect of using symbolic simulation with SAT-based reparametrization within the Counterexample Guided Abstraction Refinement framework. Abstraction refinement has been applied successfully to prove safety properties of large industrial circuits. However, all existing abstraction refinement frameworks simply use SAT-based Bounded Model ...
متن کاملSymbolic LAO* Search for Factored Markov Decision Processes
We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. It uses state abstraction to avoid evaluating states individually. And it uses forward search from a start state, guided by an admissible heuristic, to avoid evaluating all states. These approaches are combined in a novel way that exploits symbolic model-checking techniq...
متن کاملAbstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems
ion Refinement with Craig Interpolation and Symbolic Pushdown Systems ? Javier Esparza, Stefan Kiefer, and Stefan Schwoon Institute for Formal Methods in Computer Science, University of Stuttgart {esparza,kiefersn,schwoosn}@informatik.uni-stuttgart.de Abstract. Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model-checking. In this paper, we ...
متن کامل